IS GROUND A STRICT PARTIAL ORDER?RAVEN, Michael J.American philosophical quarterly (Oxford). 2013, Vol 50, Num 2, pp 193-201, issn 0003-0481, 9 p.Article

Finite unfoldings of unbounded Petri netsDESEL, Jörg; JUHAS, Gabriel; NEUMAIR, Christian et al.Lecture notes in computer science. 2004, pp 157-176, issn 0302-9743, isbn 3-540-22236-7, 20 p.Conference Paper

Modelling concurrent behaviours by communicativity and weak causality relationsGUANGYUAN GUO; JANICKI, Ryszard.Lecture notes in computer science. 2002, pp 178-191, issn 0302-9743, isbn 3-540-44144-1, 14 p.Conference Paper

Invariants for the construction of a handshake registerHESSELINK, W. H.Information processing letters. 1998, Vol 68, Num 4, pp 173-177, issn 0020-0190Article

Application des méthodes d'ordre partiel aux équivalences comportementales des systèmes concurrents = Application of partial-order methods to the behavioural equivalences of concurrent systemsLara De Souza Robert, Monica; De Simone, R.1995, 105 p.Thesis

Some results on the Sarkovskii partial ordering of permutationsJUNGREIS, I.Transactions of the American Mathematical Society. 1991, Vol 325, Num 1, pp 319-344, issn 0002-9947Article

On the Kleene degrees of Π₁¹ setsSLAMAN, T. A.The Journal of symbolic logic. 1986, Vol 51, Num 2, pp 352-359, issn 0022-4812Article

Probabilité d'arrêt sur une variante non dominéeBARYSHNIKOV, YU. M; BEREZOVSKIJ, B. A; GNEDIN, A. V. et al.Avtomatika i telemehanika. 1984, Num 10, pp 131-137, issn 0005-2310Article

Well quasi orders and the shuffle closure of finite setsD'ALESSANDRO, Flavio; RICHOMME, Gwénaël; VARRICCHIO, Stefano et al.Lecture notes in computer science. 2006, pp 260-269, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 10 p.Conference Paper

Stubborn sets for priority netsVARPAANIEMI, Kimmo.Lecture notes in computer science. 2004, pp 574-583, issn 0302-9743, isbn 3-540-23526-4, 10 p.Conference Paper

A weak order approach to group rankingJANICKI, R; KOCZKODAJ, W. W.Computers & mathematics with applications (1987). 1996, Vol 32, Num 2, pp 51-59, issn 0898-1221Article

The minimal L₁ isotonic regressionNING-ZHONG SHI.Communications in statistics. Theory and methods. 1995, Vol 24, Num 1, pp 175-189, issn 0361-0926Article

Semigroups of tolerance relationsSCHEIN, B. M.Discrete mathematics. 1987, Vol 64, Num 2-3, pp 253-262, issn 0012-365XArticle

Random graphs, random triangle-free graphs, and random partial ordersPRÖMEL, Hans Jürgen; TARAZ, Anusch.Computational discrete mathematics (advanced lectures). Lecture notes in computer science. 2001, pp 98-118, issn 0302-9743, isbn 3-540-42775-9Book Chapter

Preservation of some partial orderings under Poisson shock modelsHARSHINDER SINGH; KANCHAN JAIN.Advances in applied probability. 1989, Vol 21, Num 3, pp 713-716, issn 0001-8678, 4 p.Article

Modelling with partial orders - why and why not?NIELSEN, Mogens.Lecture notes in computer science. 2001, pp 61-63, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Similarity relations, fuzzy linear orders, and fuzzy partial ordersKUNDU, S.Fuzzy sets and systems. 2000, Vol 109, Num 3, pp 419-428, issn 0165-0114Article

Every self-dual ordering has a self-dual linear extensionZHONG-QIANG YANG.Order (Dordrecht). 1987, Vol 4, Num 2, pp 97-100, issn 0167-8094Article

Proportional transitivity in linear extensions of ordered setsFISHBURN, P. C.Journal of combinatorial theory. Series B. 1986, Vol 41, Num 1, pp 48-60, issn 0095-8956Article

Decomposition orders : another generalisation of the fundamental theorem of arithmeticLUTTIK, Bas; VAN OOSTROM, Vincent.Report - Software engineering. 2004, Num 14, pp 1-36, issn 1386-369X, 36 p.Article

Stone spaces and ideals of posetsBEKKALI, M; ZHANI, D.Knowledge discovery and discrete mathematics. International conferenceJIM'2003 : journées de l'informatique messine. 2003, pp 131-136, isbn 2-7261-1256-0, 6 p.Conference Paper

Existence of efficient points in vector optimization and generalized Bishop-Phelps theoremNG, K. F; ZHENG, X. Y.Journal of optimization theory and applications. 2002, Vol 115, Num 1, pp 29-47, issn 0022-3239Article

Regular sets of pomsets with autoconcurrencyFANCHON, Jean; MORIN, Rémi.Lecture notes in computer science. 2002, pp 402-417, issn 0302-9743, isbn 3-540-44043-7, 16 p.Conference Paper

The complexity of computing the size of an intervalHEMASPAANDRA, Lane A; KOSUB, Sven; WAGNER, Klaus W et al.Lecture notes in computer science. 2001, pp 1040-1051, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Minimizing a convex cost closure setHOCHBAUM, D. S; QUEYRANNE, M.Lecture notes in computer science. 2000, pp 256-267, issn 0302-9743, isbn 3-540-41004-XConference Paper